Algorithm for Generating Primes for the Giuliani-Gong Public Key System
نویسنده
چکیده
In this paper we propose an algorithm for computing large primes p and q such that q divides p4 + p3 + p2 + p+ 1 or p4 − p3 + p2 − p+ 1. Such primes are key parameters for the GiulianiGong Public Key System.
منابع مشابه
Fast Generation of Prime Numbers and
A very eecient recursive algorithm for generating nearly random prov-able primes is presented. The expected time for generating a prime is only slightly greater than the expected time required for generating a pseudo-prime of the same size that passes the Miller-Rabin test for only one base. Therefore our algorithm is even faster than presently-used algorithms for generating only pseudo-primes ...
متن کاملGenerating Primes Using Partitions
This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested using either Miller Rabin or AKS primality tests. Introduction Generation of large prime numbers is fundamental to modern cryptography protocols [1],[2], generat...
متن کاملNew Methods of Generating Primes Secure against Both P − 1 and P + 1 Methods ∗
Since cryptosystem based on the problem of factoring the composite number N can be attacked with P − 1 and P +1 methods, it is required that P −1 and P +1 should be difficult to be factored into many small primes, where we assume that the P is a factor of N . In this paper, first, we consider the distribution of secure primes against both P −1 and P +1 methods. Second, we propose two efficient ...
متن کاملOptimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usable in practical settings, so our protocol is robust and efficient in asynchronous, hostile environments. We show that the techniques used for robustness need special care when they must be efficient. Specifically, we s...
متن کاملDigital Signatures from Strong RSA without Prime Generation
We construct a signature scheme that is proved secure, without random oracles, under the strong RSA assumption. Unlike other efficient strong-RSA based schemes, the new scheme does not generate large prime numbers during signing. The public key size and signature size are competitive with other strong RSA schemes, but verification is less efficient. The new scheme adapts the prefix signing tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Internet Serv. Inf. Secur.
دوره 1 شماره
صفحات -
تاریخ انتشار 2011